منابع مشابه
Generalized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs
Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...
متن کاملA Framework for Aberration Compensated Displays
We are building upon our earlier work in Vision-Realistic Rendering, which is the computation of a displayed image that incorporates the characteristics of a particular individual’s entire optical system. The key concept is, given the optical measurements of an individual’s optical system, perform an “inverse blurring” computation on what would normally be displayed such that when this blurred ...
متن کاملA Unified Framework for Metaheuristics
Over the past decades, a multitude of new search heuristics, often called “metaheuristics” have been proposed, many of them inspired by principles observed in nature. What distinguishes them from random search is primarily that they maintain some sort of memory of the information gathered during the search so far, and that they use this information to select the location where the search space ...
متن کاملA Unified Framework for Delineation of Ambulatory Holter ECG Events via Analysis of a Multiple-Order Derivative Wavelet-Based Measure
In this study, a new long-duration holter electrocardiogram (ECG) major events detection-delineation algorithm is described which operates based on the false-alarm error bounded segmentation of a decision statistic with simple mathematical origin. To meet this end, first three-lead holter data is pre-processed by implementation of an appropriate bandpass finite-duration impulse response (FIR) f...
متن کاملA unified framework for primal-dual methods in minimum cost network flow problems
We introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. The algorithms are of the primal-dual type. They maintain primat feasibility with respect to capacity constraints, while trying to satisfy the conservation of flow equation at each node by means of a wide variety of procedures based on flow augmentation, price adjustment, and ascent of a dual func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistica Sinica
سال: 2022
ISSN: 1017-0405
DOI: 10.5705/ss.202019.0416